query time
英 [ˈkwɪəri taɪm]
美 [ˈkwɪri taɪm]
网络 查询时间
双语例句
- But there's no way at query time to override an association to use the default eager evaluation techniques ( second but immediate query).
但是，无法在查询时覆盖关联来使用默认的即时抓取技术（第二个查询立即执行）。 - So we create a spatial grid index that will be used at query time.
所以我们创建一个空间网格索引，这个索引将在查询时用到。 - The key thing we want to look at is Query_time, which shows how long the query took.
我们想要考虑的关键对象是Querytime，显示查询需要的时间。 - The ability to load data into HashMaps where column names are not known at query time.
将数据加载到HashMaps的功能（在查询时列名是未知的）。 - The pureXML technology in DB29 parses XML documents at insert time and never at query time.
DB29中的pureXML技术在插入时（而不是查询时）解析XML文档。 - XQuery over XML data in XML type columns can be40 times faster than corresponding queries over CLOB columns which require XML parsing at query time.
XML类型列中XML数据的XQuery速度比CLOB的对应查询（需要在查询时进行XML解析）速度快了40倍。 - To check if a spatial grid index is actually exploited during query time, you should have a look at the access plan.
为检查在查询时是否真正使用了一个空间网格索引，应该查看一下访问计划。 - The recommendation is to issue RUNSTATS if the savings in total query elapsed time is much greater than the additional time to do RUNSTATS.
如果整个查询经过时间中所节省的时间比完成RUNSTATS所增加的时间大得多，就建议发出RUNSTATS。 - By making data types consistent within the DDL, there is less overhead associated with conversion of data at query run time.
通过在DDL中确保数据类型一致，在查询运行当中与数据转换相关的开销会比较小。 - REOPT ONCE: Query optimization occurs once at query execution time, when the query is executed for the first time.
REOPTONCE：查询执行中只发生一次查询优化，即在查询第一次执行时。 - The effects of clustering the rows by their spatial properties rely on accessing just a subset of the data during query time.
按照空间属性聚集这些行的效果取决于在查询时对一个数据子集的访问。 - REOPT ALWAYS: Query optimization or reoptimization occurs at query execution time every time the query is executed.
REOPTALWAYS：每一次查询执行时都发生查询优化或重新优化。 - Using a text index makes document search much more efficient, as the text data does not need to be examined at query time like it is done with sub-string matching.
使用文本索引使文档搜索的效率大大提高，因为不需要像进行子字符串匹配时那样在查询时检查文本数据。 - We'll only need to do the query one time.
我们仅需一次执行查询。 - This is where the real benefit of pureXML kicks in: XML is stored in a parsed format, so no parsing is required at query execution time.
这是pureXML的真正的妙处所在：XML以已解析格式存储，因此在查询执行时不需要解析。 - New features added to query time performance are as follows
查询中增加的新特性列举如下 - Expose entity-scoped and named analyzer for easy reuse at query time.
为了更简单的重用而在查询期暴露实体范围和命名查询器。 - The experiments on a large image database show both a remarkable reduction of I/ O overhead of the data accesses which dominates the query time in the searches and a remarkable improvement performance in the searching.
在大规模图像库上的实验表明，基于本文索引机制的搜索算法不仅显著减少了支配检索时间的I/O开销，而且具有较高的查询准确率。 - Simulations show that this model not only has higher recall, but also reduces the search cost and query time to the rate of 40% and 30% of Gnutella.
模拟实验表明，利用集合差异度构建的基于内容的搜索模型不仅具有较高的召回率，而且将搜索成本和查询时间分别降低到了Gnutella系统的40%和30%左右。 - The content-based cluster P2P search model depending on a set distance is proposed in this paper to reduce the query time and redundant messages.
本文提出利用集合差异度实现基于内容聚类的P2P搜索模型提高查询效率和减少冗余消息。 - And we analyze the query time and the precision ration.
然后我们对系统的查询时间和查准率进行分析。 - So without prejudice to the premise of for accuracy, if can reduce n, then the optimization of query time complexity has great significance.
所以在不损害查询准确度的前提下，如果能减小n，则对查询效率的优化具有很大的意义。 - Focusing on the problems of low recall ratio and long query time in the service semantic matching, the thesis presents a quality-based service semantic matching algorithm to improve the matching rate and shorten the response time of the SOA.
重点针对服务语义匹配查全率较低、查询时间过长的问题，提出了一种基于服务质量的服务语义匹配算法，以提高SOA架构的服务匹配率及服务请求的响应速度。 - The method allows querying most fresh data from the real-time storage section. It reduces data query time and minimizes the impact on continuous data loading.
该方案可以在实时存储区中查询最新鲜的数据，降低了数据更新的处理时间以及持续更新对用户查询操作的影响。 - Compared with the methods of PAA and RPAA, the FPAA method can effectively query time series online.
实验表明，与PAA方法和RPAA方法相比，所提出的方法可以比较有效的进行时间序列的在线查询。 - Efficiency test experiments are designed. Node capacity, node accessing quantity and query time of R-tree and CR-tree are analyzed in theory. Then we test and verify the theories by vector data.
设计了效率测试实验，对R树和CR树在索引节点容量、查询时节点访问量、查询时间三个方面的效率进行了理论对比分析，并用多幅矢量数据进行了验证。 - The weakness is the increasing inquired the time, so the primary problem of distributed database to solve is to choose what kind of algorithm to accelerate query time. As a new research method, ontology semantic mapping method has the function of refining research problems.
缺点是增加了查询时间，因此选择什么样的算法来加快查询时间是分布式数据库现在要解决的首要问题。 - This system can not only monitor operation condition of the pipeline real-time, detect and locate leak in time, but also replay history data by query time.
该系统不仅能实时监测管线的运行状况，及时检测泄漏的发生并进行泄漏点的定位，还能通过查询时间实现历史数据的回放。 - Including study on value of split point between different scale ellipses, and study on shortest path query time as well as searching area of multi-scale algorithm. ( 3) Two-tree ellipse shortest path algorithm and its performance analysis.
具体包括不同尺度椭圆分割点取值研究，多尺度算法搜索区域面积研究和最短路径查询时间研究等。（3）二树椭圆最短路径算法研究及其性能分析。